Deterministic Timed AFA: A New Class of Timed Alternating Finite Automata

Deterministic Timed AFA: A New Class of Timed Alternating Finite Automata

Timed Alternating Finite Automata (TAFA), a natural generalization of Timed Finite Automata (TFA), are synchronous and powerful models for real-time computations. They become an effective and expressive model for developing embedded systems with real-time constraint computations which are required in many applications. We introduce Deterministic Timed Alternating Finite Automata (DTAFA), a new ...

Extended Timed Alternating Finite Automata: Revisited

In this paper, we continue to investigate timed alternating finite automata (TAFA), in particular we generalize the existing theory to the case of extended timed alternating finite automata (ETAFA). We define a framework extension of TAFA, study their power and properties. We develop an algebraic treatment of such ETAFA, along the lines of the algebraic treatment of systems of equations based o...

Weak Alternating Timed Automata

Alternating timed automata on infinite words are considered. The main result is a characterization of acceptance conditions for which the emptiness problem for the automata is decidable. This result implies new decidability results for fragments of timed temporal logics. It is also shown that, unlike for MITL, the characterisation remains the same even if no punctual constraints are allowed.

On Almost Deterministic Timed Automata

On MITL and Alternating Timed Automata

One clock alternating timed automata (OCATA) have been recently introducedas natural extension of (one clock) timed automata to express the semantics ofMTL [11]. We consider the application of OCATA to problem of model-checkingMITL formulas (a syntactic fragment of MTL) against timed automata. We intro-duce a new semantics for OCATA where, intuitively, clock valuations are i...